A Tensor-Product Parity Code for Magnetic Recording
نویسنده
چکیده
In magnetic recording channels, a standard code architecture consists of an outer Reed-Solomon code in concatenation with an inner parity code. The inner parity code is used to detect and correct commonly occurring error events. Generally, a parity code with short block length performs better, as multiple error events within one block and, consequently, miscorrection are less likely. In this paper, we propose an inner code that offers the same system performance as a parity code with very short block length, even as short as the symbol length (in bits) of the outer Reed-Solomon code, but with higher code rate. This code is a tensor-product code, with a BCH code and a short parity code as constituent codes. The proposed decoder is not much more complex than the optimal decoder of the baseline parity-coded channel; in fact, the only additional steps are Viterbi detection matched to the channel and decoding of the BCH code.
منابع مشابه
High-Rate Short-Block LDPC Codes for Iterative Decoding with Applications to High-Density Magnetic Recording Channels
This paper investigates the Triangle Single Parity Check (T/SPC) code, a novel class of high-rate low-complexity LDPC codes. T/SPC is a regular, soft decodable, linear-time encodable/decodable code. Compared to previous high-rate and low-complexity LDPC codes, such as the well-known Turbo Product Code / Single Parity Check (TPC/SPC), T/SPC provides higher code rates, shorter code words, and low...
متن کاملLow density parity check coding for magnetic recording channels with media noise
The application of low-density parity-check (LDPC) codes for use in high-density magnetic recording channels is considered. A first order position jitter model is assumed in order to include the effect of signal dependent transition noise present in high density longitudinal thin film recording. Coding gains using pattern dependent noise-predictive soft detection to account for the transition n...
متن کاملError Locating Codes by Using Blockwise-tensor Product of Blockwise Detecting/correcting Codes
In this paper, we obtain lower and upper bounds on the number of parity check digits of a linear code that corrects e or less errors within a subblock. An example of such a code is provided. We introduce blockwise-tensor product of matrices and using this, we propose classes of error locating codes (or EL-codes) that can detect e or less errors within a sub-block and locate several such corrupt...
متن کاملThresholds for Iterative Equalization of Partial Response Channels Using Density Evolution
This paper focuses on the computing of the thresholds for iterative equalization and decoding of partial response channel, such as what are of interest in high density magnetic recording. Extensive simulations on the performance of turbo codes, low density parity check (LDPC) codes and single-parity check turbo product codes (TPC/SPC) over partial response channels reveal very encouraging bit e...
متن کاملPerpendicular and Longitudinal Recording: A Signal-Processing and Coding Perspective
Equalization and noise prediction followed by sequence detection and postprocessing are studied for double-layer perpendicular recording channels that are corrupted by electronics and transition noise. The performance of various outer coding schemes, such as conventional Reed– Solomon (RS) codes with 8-bit and 10-bit symbols and low-density parity check (LDPC) codes, is evaluated, and a signal-...
متن کامل